Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs
نویسندگان
چکیده
منابع مشابه
Symmetric and Non-Symmetric Quantum Capelli Polynomials
Generalizing the classical Capelli identity has recently attracted a lot of interest ([HU], [Ok], [Ol], [Sa], [WUN]). In several of these papers it was realized, in various degrees of generality, that Capelli identities are connected with certain symmetric polynomials which are characterized by their vanishing at certain points. From this point of view, these polynomials have been constructed b...
متن کاملh*-Vectors, Eulerian Polynomials and Stable Polytopes of Graphs
Conditions are given on a lattice polytope P of dimension m or its associated affine semigroup ring which imply inequalities for the h∗-vector (h∗0, h∗1, . . . , h∗m) of P of the form hi ≥ hd−i for 1 ≤ i ≤ bd/2c and hbd/2c ≥ hbd/2c+1 ≥ · · · ≥ hd, where hi = 0 for d < i ≤ m. Two applications to order polytopes of posets and stable polytopes of perfect graphs are included.
متن کاملHybrid Sparse Resultant Matrices for Bivariate Polynomials
We study systems of three bivariate polynomials whose Newton polygons are scaled copies of a single polygon. Our main contribution is to construct square resultant matrices, which are submatrices of those introduced by Cattani et al. (1998), and whose determinants are nontrivial multiples of the sparse (or toric) resultant. The matrix is hybrid in that it contains a submatrix of Sylvester type ...
متن کاملPermutation Matrices and the Moments of Their Characteristics Polynomials
In this paper, we are interested in the moments of the characteristic polynomial Zn(x) of the n× n permutation matrices with respect to the uniform measure. We use a combinatorial argument to write down the generating function of E [ ∏p k=1 Z sk n (xk) ] for sk ∈ N. We show with this generating function that limn→∞ E [ ∏p k=1 Z sk n (xk) ] exists for maxk |xk| < 1 and calculate the growth rate ...
متن کاملSketching Sparse Covariance Matrices and Graphs
This paper considers the problem of recovering a sparse p×p matrix X given an m×m matrix Y = AXB , where A and B are known m× p matrices with m p. The main result shows that there exist constructions of the “sketching” matrices A and B so that even if X has O(p) non-zeros, it can be recovered exactly and efficiently using convex optimization as long as these non-zeros are not concentrated in an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00069-8